3D Image Representation through Hierarchical Tensor Decomposition, Based on SVD with Elementary Tensor of size 222

نویسندگان

  • ROUMEN KOUNTCHEV
  • ROUMIANA KOUNTCHEVA
چکیده

As it is known, groups of correlated 2D images of various kind could be represented as 3D images, which are mathematically described as 3 rd order tensors. Various generalizations of the Singular Value Decomposition (SVD) exist, aimed at the tensor description reduction. In this work, new approach is presented for 3 rd order tensor decomposition, where unlike the famous methods for decomposition components definition, iterative calculations are not used. The basic structure unit of the new decomposition is an elementary tensor (ET) of size 222, which builds the 3D tensors of size N×N×N, where N=2 n . The decomposition of the single ЕТ is executed by using Hierarchical 2-level SVD, where (in each level) the SVD of size 2×2 (SVD2×2) is applied on all sub-matrices obtained after the elementary tensor unfolding. The so calculated new sub-matrices of the SVD2×2 in each hierarchical level, are rearranged in accordance with the lessening of their corresponding singular values. The computational complexity of the new tensor decomposition is lower than that of the decompositions, based on iterative methods, and permits parallel calculations for all SVD2×2 for the sub-matrices in a given hierarchical level. Key-Words: 3D images, tensor decomposition, Hierarchical SVD (HSVD), elementary tensor of size 222.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Decomposition of 2D/3D Images, Based on SVD 2×2

The famous Singular Value Decomposition (SVD) is very efficient in the processing of multidimensional images, when efficient compression, and reduction of the features, used for objects recognition, are needed. The basic obstacle for the wide use of SVD is its high computational complexity. To solve the problem, here is offered the new approach for hierarchical image decomposition through SVD (...

متن کامل

A Randomized Tensor Train Singular Value Decomposition

The hierarchical SVD provides a quasi-best low rank approximation of high dimensional data in the hierarchical Tucker framework. Similar to the SVD for matrices, it provides a fundamental but expensive tool for tensor computations. In the present work we examine generalizations of randomized matrix decomposition methods to higher order tensors in the framework of the hierarchical tensors repres...

متن کامل

Multi-View Subspace Clustering via Relaxed L1-Norm of Tensor Multi-Rank

In this paper, we address the multi-view subspace clustering problem. Our method utilize the circulant algebra for tensor, which is constructed by stacking the subspace representation matrices of different views and then shifting, to explore the high order correlations underlying multi-view data. By introducing a recently proposed tensor factorization, namely tensor-Singular Value Decomposition...

متن کامل

BTF Compression via Sparse Tensor Decomposition

In this paper, we present a novel compression technique for Bidirectional Texture Functions based on a sparse tensor decomposition. We apply the K-SVD algorithm along two different modes of a tensor to decompose it into a small dictionary and two sparse tensors. This representation is very compact, allowing for considerably better compression ratios at the same RMS error than possible with curr...

متن کامل

Tensor reduction error analysis - Applications to video compression and classification

Tensor based dimensionality reduction has recently been extensively studied for computer vision applications. To our knowledge, however, there exist no rigorous error analysis on these methods. Here we provide the first error analysis of these methods and provide error bound results similar to Eckart-Young Theorem which plays critical role in the development and application of singular value de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016